The Largest Component in a Subcritical Random Graph with a Power Law Degree Distribution

It is shown that in a subcritical random graph with given vertex degrees satisfying a power law degree distribution with exponent γ > 3, the largest component is of order n. More precisely, the order of the largest component is approximatively given by a simple constant times the largest vertex degree. These results are extended to several other random graph models with power law degree distributions. This proves a conjecture by Durrett.